Odd cutsets and the hard-core model on $\mathbb{Z}^{d}$
نویسندگان
چکیده
منابع مشابه
ODD CUTSETS AND THE HARD-CORE MODEL ON Zd
We consider the hard-core lattice gas model on Z and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds Cd−1/3(log d), the model exhibits multiple hard-core measures, thus improving the previous bound of Cd−1/4(log d) given by Galvin and Kahn. At the heart of our approach lies the study of a certain class of edge cutsets in Z, the so-called od...
متن کاملOn phase transition in the hard-core model on Z
It is shown that the hard-core model on Zd exhibits a phase transition at activities above some function λ(d) which tends to zero as d→∞; that is: Consider the usual nearest neighbor graph on Zd, and write E and O for the sets of even and odd vertices (defined in the obvious way). Set ΛM = Λ d M = {z ∈ Z : ‖z‖∞ ≤M}, ∂ΛM = {z ∈ Z : ‖z‖∞ = M}, and write I(ΛM ) for the collection of independent se...
متن کاملThe Finite-state Hard Core Model on a Regular Tree
The classical hard core model from statistical physics, with activity λ > 0 and capacity C = 1, on a graph G, concerns a probability measure on the set I(G) of independent sets of G, with the measure of each independent set I ∈ I(G) being proportional to λ|I|. When G is a (b + 1)-regular tree, a generalization of the hard core model that has capacity C larger than one was studied by Mitra et al...
متن کاملThe Multistate Hard Core Model on a Regular Tree
The classical hard core model from statistical physics, with activity λ > 0 and capacity C = 1, on a graph G, concerns a probability measure on the set I(G) of independent sets of G, with the measure of each independent set I ∈ I(G) being proportional to λ|I|. Ramanan et al. proposed a generalization of the hard core model as an idealized model of multicasting in communication networks. In this...
متن کاملThe hard-core model on random graphs revisited
We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random graphs with small and very large average degrees respectively are quite well understood, they yield qualitatively different results and our aim here is to reconc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2014
ISSN: 0246-0203
DOI: 10.1214/12-aihp535